Bayesian Learning via Stochastic Gradient Langevin Dynamics

Source URL: www.ics.uci.edu

• Computational statistics
• Stochastic optimization
• Statistical mechanics
• Estimation theory
• Markov chain Monte Carlo
• Langevin dynamics
• Stochastic approximation
• Metropolis–Hastings algorithm
• Mixture model
• Statistics
• Probability and statistics
• Monte Carlo methods

A (1 + ")-Approximation Algorithm for 2-Line-Center  Pankaj K. Agarwaly Cecilia M. Procopiuc y Kasturi R. Varadarajanz

Source URL: www.cs.duke.edu

LNCSCircle of Friend Query in Geo-Social Networks

Source URL: www.cse.unt.edu

• Search algorithms
• Approximation algorithms
• Mathematical optimization
• NP-complete problems
• Analysis of algorithms
• Nearest neighbor search
• Clique problem
• K-nearest neighbor algorithm
• Time complexity
• Theoretical computer science
• Mathematics
• Applied mathematics

Approximation Algorithms for Projective Clustering  Pankaj K. Agarwalz y Cecilia M. Procopiuc z

Source URL: www.cs.duke.edu

• Analysis of algorithms
• Probabilistic complexity theory
• Randomized algorithm
• Factorial
• Factorization of polynomials over a finite field and irreducibility tests
• Euclidean algorithm
• Mathematics
• Combinatorics
• Number theory

BRICS Basic Research in Computer Science BRICS RS-01-6 Gutin et al.: Domination Analysis of Greedy-Type Heuristics for the TSP

Source URL: www.brics.dk

• Operations research
• NP-complete problems
• Nearest neighbour algorithm
• Integer sequences
• Greedy algorithm
• Domination analysis
• Factorial
• Heuristic function
• Summation
• Mathematics
• Approximation algorithms
• Travelling salesman problem

Q IWA Publishing 2006 Journal of Hydroinformatics | 08.3 | A fixed functional set genetic algorithm (FFSGA) approach for function approximation

Source URL: www.iwaponline.com

Seminar on Algorithms and Geometry – Handout 3 Robert Krauthgamer April 2, 2009 Today’s topics • Approximation algorithm for Sparsest-Cut via embedding into `1 (continued from last time).

Source URL: www.wisdom.weizmann.ac.il

A Fast Approximation Algorithm for Tree-Sparse Recovery Chinmay Hegde, Piotr Indyk, Ludwig Schmidt1 Massachusetts Institute of Technology Abstract—Sparse signals whose nonzeros obey a tree-like

Source URL: people.csail.mit.edu

A Greedy Approximation Algorithm for Minimum-Gap Scheduling Marek Chrobak1? , Uriel Feige2 , Mohammad Taghi Hajiaghayi3?? , Sanjeev Khanna4 , Fei Li5? ? ? , and Seffi Naor6 1

Source URL: www.wisdom.weizmann.ac.il

An Algorithm for Low-rank Approximation of Bivariate Functions using Splines I. Georgieva, C. Hofreither G+S Report No. 28 Mai 2015

Source URL: www.gs.jku.at